On Vandermonde Varieties
نویسنده
چکیده
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal varieties, which we call Vandermonde varieties. They are closely related to the varieties consisting of all linear recurrence relations of a given order possessing a non-trivial solution vanishing at a given set of integers. In the regular case, i.e., when the dimension of a Vandermonde variety is the expected one, we present its free resolution, obtain its degree and the Hilbert series. Some interesting relations among Schur polynomials are derived. Many open problems and conjectures are posed.
منابع مشابه
Vandermonde Varieties and Relations among Schur Polynomials
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal varieties which we call Vandermonde varieties. They are closely related to the varieties consisting of all linear recurrence relations of a given order possessing a non-trivial solution vanishing at a given set of integers. In the regular case, i.e., when the dimension of a...
متن کاملLinear Recurrences and Vandermonde Varieties. I
Motivated by the famous Skolem-Mahler-Lech theorem we initiate in this paper the study of a natural class of determinantal varieties which we call Vandermonde varieties. They are closely related to the varieties of linear recurrence relations of a given order possessing a non-trivial solution vanishing at a given set of integers. In the regular case, i.e. when the dimension of a Vandermonde var...
متن کاملLinear Projections of the Vandermonde Polynomial
An n-variate Vandermonde polynomial is the determinant of the n × n matrix where the ith column is the vector (1, xi, x 2 i , . . . , x n−1 i ) T . Vandermonde polynomials play a crucial role in the theory of alternating polynomials and occur in Lagrangian polynomial interpolation as well as in the theory of error correcting codes. In this work we study structural and computational aspects of l...
متن کاملA Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...
متن کاملA Study of Vandermonde-like Matrix Systems With Emphasis on Preconditioning and Krylov Matrix Connection
The study focuses primarily on Vandermonde-like matrix systems. The idea is to express Vandermonde and Vandermonde-like matrix systems as the problems related to Krylov Matrices. The connection provides a different angle to view the Vandermondelike systems. Krylov subspace methods are strongly related to polynomial spaces, hence a nice connection can be established using LU factorization as pro...
متن کامل